Dynamic Timed Automata for Reconfigurable System Modeling and Verification

Modeling, Verification and Testing using Timed and Hybrid Automata

ion. The main idea of this approach is to start with a rough (conservative and often discrete) approximation of a hybrid system and then iteratively refine it. This refinement is often local in the sense that it uses the previous analysis results to determine where the approximation error is too large to prove the property (see for example [96, 8, 28]). A popular abstraction approach is predica...

Synthia: Verification and Synthesis for Timed Automata

We present Synthia, a new tool for the verification and synthesis of open real-time systems modeled as timed automata. The key novelty of Synthia is the underlying abstraction refinement approach [5] that combines the efficient symbolic treatment of timing information by difference bound matrices (DBMs) with the usage of binary decision diagrams (BDDs) for the discrete parts of the system descr...

Timed Automata Approach to Distributed and Fault Tolerant System Verification

This article deals with a distributed, fault-tolerant real-time application modeling by timed automata. The application under consideration consists of several processors communicating via Controller Area Network (CAN); each processor executes an application that consists of fault-tolerant tasks running under an operating system (e.g. OSEK) and using inter-task synchronization primitives. For s...

Verification on Interrupt Timed Automata

The class of Interrupt Timed Automata (ITA) has been introduced to model multi-task systems with interruptions in a single processor environment. This is a subclass of hybrid automata in which real valued variables consist of a restricted type of stopwatches (variables with rate 0 or 1) organized along levels. While reachability is undecidable with usual stopwatches, it was proved that this pro...

Data-Structures for Verification of Timed Automata